Search results for "Elgot"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
51	Matthias Galota, Heribert Vollmer	A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.	CSL	2001	DBLP DOI BibTeX RDF
41	Olivier Carton, Wolfgang Thomas	The Monadic Theory of Morphic Infinite Words and Generalizations.	MFCS	2000	DBLP DOI BibTeX RDF
41	Zoltán Ésik	Iteration Theories of Boolean Functions.	MFCS	2000	DBLP DOI BibTeX RDF
36	Joost Engelfriet, Hendrik Jan Hoogeboom	MSO definable string transductions and two-way finite-state transducers.	ACM Trans. Comput. Log.	2001	DBLP DOI BibTeX RDF	Büchi, Elgot, Hennie machine, Trakhtenbrot, string transductions, two-way finite-state transducers, interpretation, monadic second-order logic
35	Kevin Gary, Jennifer J. Elgot-Drapkin	A flexible marker-passer for semantically weak search.	SAC	1994	DBLP DOI BibTeX RDF	marker-passing, search, knowledge representation, commonsense reasoning, connectionist models
35	Donald Perlis, Jennifer J. Elgot-Drapkin, Michael J. Miller	Stop the world - I want to think.	Int. J. Intell. Syst.	1991	DBLP DOI BibTeX RDF
35	Jennifer J. Elgot-Drapkin	Step-Logic and the Three-Wise-Men Problem.	AAAI	1991	DBLP BibTeX RDF
35	Jennifer J. Elgot-Drapkin, Donald Perlis	Reasoning situated in time I: basic concepts.	J. Exp. Theor. Artif. Intell.	1990	DBLP DOI BibTeX RDF
35	Jennifer J. Elgot-Drapkin, Donald Perlis	A preliminary excursion into step-logics.	ISMIS	1986	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Alan J. Perlis, Lawrence Snyder	A Syntax-Free Semantics for the APL Operators.	Inf. Process. Lett.	1982	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Stephen L. Bloom	Selected papers.		1982	RDF
35	Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright	Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF
35	Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright	Vector Iteration in Pointed Iterative Theories.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, John C. Shepherdson	A Semantically Meaningful Characterization of Reducible Flowchart Schemes.	Theor. Comput. Sci.	1979	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell	On the Algebraic Atructure of Rooted Trees.	J. Comput. Syst. Sci.	1978	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	A representative strong equivalence class for accessible flowchart schemes.	Mathematical Studies of Information Processing	1978	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Lawrence Snyder	On the Many Facets of Lists.	Theor. Comput. Sci.	1977	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	Finite Automaton from a Flowchart Scheme Point of View.	MFCS	1977	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	Some "Geometrical" Categories Associated with Flowchart Schemes.	FCT	1977	DBLP DOI BibTeX RDF
35	Stephen L. Bloom, Calvin C. Elgot	The Existence and Construction of Free Iterative Theories.	J. Comput. Syst. Sci.	1976	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	Erratum and Corrigendum for "Structured Programming With and Without GO TO Statments".	IEEE Trans. Software Eng.	1976	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	Structured Programming With and Without GO TO Statements.	IEEE Trans. Software Eng.	1976	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	Algebraic theories and program schemes.	Symposium on Semantics of Algorithmic Languages	1971	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	The common algebraic structure of exit-automata and machines.	Computing	1970	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Michael O. Rabin	Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.	J. Symb. Log.	1966	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Jorge E. Mezei	On Relations Defined by Generalized Finite Automata.	IBM J. Res. Dev.	1965	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Abraham Robinson	Random-Access Stored-Program Machines, an Approach to Programming Languages.	J. ACM	1964	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Joseph D. Rutledge	RS -Machines with Almost Blank Tape.	J. ACM	1964	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Jorge E. Mezei	Two-sided finite-state transductions (abbreviated version)	SWCT	1963	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Joseph D. Rutledge	Machine properties preserved under state minimization	SWCT	1962	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Joseph D. Rutledge	Operations of finite automata	SWCT	1961	DBLP DOI BibTeX RDF
35	Calvin C. Elgot, Saburo Muroga	Two problems on threshold functions	SWCT	1961	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	Truth functions realizable by single threshold organs	SWCT	1960	DBLP DOI BibTeX RDF
35	Irving M. Copi, Calvin C. Elgot, Jesse B. Wright	Realization of Events by Logical Nets.	J. ACM	1958	DBLP DOI BibTeX RDF
35	Calvin C. Elgot	On Single vs. Triple Address Computing Machines	J. ACM	1954	DBLP DOI BibTeX RDF
31	Sergey Goncharov 0001	Shades of Iteration: from Elgot to Kleene.	CoRR	2023	DBLP DOI BibTeX RDF
31	Sergey Goncharov 0001	Shades of Iteration: From Elgot to Kleene.	WADT	2022	DBLP DOI BibTeX RDF
31	Sergey Goncharov 0001	Uniform Elgot Iteration in Foundations.	CoRR	2021	DBLP BibTeX RDF
31	Sergey Goncharov 0001	Uniform Elgot Iteration in Foundations.	ICALP	2021	DBLP DOI BibTeX RDF
31	Joost Engelfriet, Heiko Vogler	A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage.	Discret. Math. Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
31	Joost Engelfriet, Heiko Vogler	A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage.	CoRR	2019	DBLP BibTeX RDF
31	Paul Blain Levy, Sergey Goncharov 0001	Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot.	CALCO	2019	DBLP DOI BibTeX RDF
31	Sergey Goncharov 0001, Stefan Milius, Christoph Rauch	Complete Elgot Monads and Coalgebraic Resumptions.	MFPS	2016	DBLP DOI BibTeX RDF
31	Sergey Goncharov 0001, Stefan Milius, Christoph Rauch	Complete Elgot Monads and Coalgebraic Resumptions.	CoRR	2016	DBLP BibTeX RDF
31	Heiko Vogler, Manfred Droste, Luisa Herrmann 0001	A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem.	LATA	2016	DBLP DOI BibTeX RDF
31	Jirí Adámek, Stefan Milius, Jirí Velebil	Elgot theories: a new perspective on the equational properties of iteration.	Math. Struct. Comput. Sci.	2011	DBLP DOI BibTeX RDF
31	Jirí Adámek, Stefan Milius, Jirí Velebil	Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract).	MFPS	2009	DBLP DOI BibTeX RDF
31	Jirí Adámek, Stefan Milius, Jirí Velebil	Elgot Algebras	CoRR	2006	DBLP BibTeX RDF
31	Jirí Adámek, Stefan Milius, Jirí Velebil	Elgot Algebras.	Log. Methods Comput. Sci.	2006	DBLP DOI BibTeX RDF
31	Jirí Adámek, Stefan Milius, Jirí Velebil	Elgot Algebras: (Extended Abstract).	MFPS	2005	DBLP DOI BibTeX RDF
31	Wolfgang Thomas	Die Logiken von Boole und Büchi-Elgot-Trakhtenbrot in der Beschreibung diskreter Systeme.	Angewandte Mathematik, insbesondere Informatik	1999	DBLP DOI BibTeX RDF
31	Zoltán Ésik	On the weak equivalence of Elgot's flow-chart schemata.	Acta Cybern.	1985	DBLP BibTeX RDF
31	John C. Shepherdson	In Memoriam Calvin C. Elgot.	Theor. Comput. Sci.	1981	DBLP DOI BibTeX RDF
21	Jirí Adámek, Stefan Milius, Jirí Velebil	A Description of Iterative Reflections of Monads (Extended Abstract).	FoSSaCS	2009	DBLP DOI BibTeX RDF
21	Angelo Montanari, Gabriele Puppis	A Contraction Method to Decide MSO Theories of Deterministic Trees.	LICS	2007	DBLP DOI BibTeX RDF
21	Manfred Droste, George Rahonis	Weighted Automata and Weighted Logics with Discounting.	CIAA	2007	DBLP DOI BibTeX RDF	weighted Büchi and Muller automata, weighted MSO logic, discounting, formal power series, weighted automata
21	Manfred Droste, Paul Gastin	Weighted Automata and Weighted Logics.	ICALP	2005	DBLP DOI BibTeX RDF
21	Gordon J. Brebner	Programmable Logic Has More Computational Power than Fixed Logic.	FPL	2004	DBLP DOI BibTeX RDF
21	Tanguy Urvoy	Composition of Path Transductions.	ICGT	2004	DBLP DOI BibTeX RDF
21	Tore Langholm, Marc Bezem	A Descriptive Characterisation of Even Linear Languages.	Grammars	2003	DBLP DOI BibTeX RDF	even linear languages, descriptive complexity
21	Moshe Y. Vardi	Logic and Automata: A Match Made in Heaven.	ICALP	2003	DBLP DOI BibTeX RDF
21	Felice Cardone	An Algebraic Approach to the Interpretation of Recursive Types.	CAAP	1992	DBLP DOI BibTeX RDF
21	Jacques Sakarovitch	Kleene's theorem revisited.	IMYCS	1986	DBLP DOI BibTeX RDF
21	Wilfried Brauer, Klaus-Jörn Lange	Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones.	STACS	1985	DBLP DOI BibTeX RDF
21	Hartmut Schmeck	Algebraic Semantics of Recursive Flowchart Schemes.	ICALP	1982	DBLP DOI BibTeX RDF
21	Michael A. Arbib	Turing Machines, Finite Automata and Neural Nets.	J. ACM	1961	DBLP DOI BibTeX RDF