On the public citation graph
Decision problems forω-automata
0 signed · 255 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_26openalex-snapshot
Definability in the Monadic Second-Order Theory of Successor
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0280205-0openalex-snapshot
Solving sequential conditions by finite-state strategies
inferredcites →https://doi.org/10.1109/swat.1968.30openalex-snapshot
Structure of undecidable problems in automata theory
inferredcites →https://doi.org/10.2307/2271090openalex-snapshot
Definability in the monadic second-order theory of successor
inferredcites →https://doi.org/10.2307/2314883openalex-snapshot
Sets of Numbers Defined by Finite Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse410openalex-snapshot
Specification Formalisms and Models
inferred← citeshttps://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferred← citeshttps://doi.org/10.1006/inco.1995.1036openalex-snapshot
On the Expressiveness of Temporal Logic Programming
inferred← citeshttps://doi.org/10.1007/11541868_22openalex-snapshot
From PSL to LTL: A Formal Validation in HOL
inferred← citeshttps://doi.org/10.1007/11672142_24openalex-snapshot
On the Accepting Power of 2-Tape Büchi Automata
inferred← citeshttps://doi.org/10.1007/11874683_26openalex-snapshot
Solving Games Without Determinization
inferred← citeshttps://doi.org/10.1007/11901914_11openalex-snapshot
On the Construction of Fine Automata for Safety Properties
inferred← citeshttps://doi.org/10.1007/11901914_12openalex-snapshot
On the Succinctness of Nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_233openalex-snapshot
Multiplicity functions on ω-automata
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_14openalex-snapshot
The residue of vector sets with applications to decidability problems in petri nets
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_6openalex-snapshot
Infinite behaviour and fairness in petri nets
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_20openalex-snapshot
Deterministic and non ambiguous rational ω-languages
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_25openalex-snapshot
Logical formulas and four subclasses of ω-regular languages
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_75openalex-snapshot
Varietes de Semis Groupes et Mots Infinis
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_85openalex-snapshot
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_79openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_97openalex-snapshot
Complexity gaps of Turing machines on infinite words
inferred← citeshttps://doi.org/10.1007/3-540-34874-3_6openalex-snapshot
A Theory of Interactive Computation
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_22openalex-snapshot
Deciding the First Level of the μ-Calculus Alternation Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_26openalex-snapshot
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_36openalex-snapshot
Alternating Automata and Logics over Infinite Words
inferred← citeshttps://doi.org/10.1007/3-540-45005-x_26openalex-snapshot
Tiling Systems over Infinite Pictures and Their Acceptance Conditions
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_12openalex-snapshot
On Infinitary Rational Relations and Borel Sets
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_3openalex-snapshot
ω-Regular Languages Are Testable with a Constant Number of Queries
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_8openalex-snapshot
Optimal Bounds for Transformations of ω-Automata
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_17openalex-snapshot
Weak Muller Acceptance Conditions for Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-50580-6_30openalex-snapshot
On questions of fairness and temporal logic for conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_91openalex-snapshot
Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_30openalex-snapshot
Rank of rational finitely generated W-languages
inferred← citeshttps://doi.org/10.1007/3-540-51734-0_58openalex-snapshot
Learning ω-regular languages from queries and counter-examples (a preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_50openalex-snapshot
Semantic for abstract fairness using metric spaces
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_60openalex-snapshot
Locally threshold testable languages of infinite words
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_62openalex-snapshot
Recursive automata on infinite words
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_29openalex-snapshot
Logical specifications of infinite computations
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_121openalex-snapshot
Finite-state strategies in regular infinite games
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_54openalex-snapshot
On polynomial-size programs winning finite-state games
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_162openalex-snapshot
The Wadge-Wagner hierarchy of ω-rational sets
inferred← citeshttps://doi.org/10.1007/978-1-4471-0751-4_22openalex-snapshot
On the Power of Reading the Whole Infinite Input Tape
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4757-2574-2_8openalex-snapshot
Combinatorial Criteria Over Graphs of Specification to Decide Synthesis by Sequential Circuits
inferred← citeshttps://doi.org/10.1007/978-3-030-17601-3_2openalex-snapshot
Learning Büchi Automata and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_21openalex-snapshot
The Automatic Baire Property and an Effective Property of $$\omega $$-Rational Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_27openalex-snapshot
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_4openalex-snapshot
On the High Complexity of Petri Nets $$\omega $$-Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_20openalex-snapshot
Certifying Inexpressibility
inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_12openalex-snapshot
Minimization of Automata for Liveness Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_3openalex-snapshot
An Impossibility Result in Automata-Theoretic Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_12openalex-snapshot
Logic vs Topology on Regular $$\omega $$-languages
inferred← citeshttps://doi.org/10.1007/978-3-031-42034-4_1openalex-snapshot
Introduction: Prerequisites
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_4openalex-snapshot
Easy Complementation of History-Deterministic Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_30openalex-snapshot
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_4openalex-snapshot
Automata Theory and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_14openalex-snapshot
Subword Metrics for Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_13openalex-snapshot
Spanning the Spectrum from Safety to Liveness
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_3openalex-snapshot
A Note on Monitors and Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_8openalex-snapshot
A Complexity Measure on Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_16openalex-snapshot
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-540-27812-2_24openalex-snapshot
Complexity of Evolving Interactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_27openalex-snapshot
Typeness for ω-Regular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_37openalex-snapshot
Reasoning About Co–Büchi Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_38openalex-snapshot
Foundations for the Run-Time Monitoring of Reactive Systems – Fundamentals of the MaC Language
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_14openalex-snapshot
Infinite Behaviour and Fairness
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_10openalex-snapshot
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_5openalex-snapshot
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_5openalex-snapshot
Tightening the Exchange Rates Between Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_17openalex-snapshot
Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_42openalex-snapshot
Complexity of Topological Properties of Regular ω-Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_14openalex-snapshot
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_18openalex-snapshot
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_16openalex-snapshot
Power of Randomization in Automata on Infinite Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_10openalex-snapshot
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_8openalex-snapshot
The Quest for a Tight Translation of Büchi to co-Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_4openalex-snapshot
Promptness in ω-Regular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-19237-1_10openalex-snapshot
Reasoning about Finite-State Switched Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-20674-0_6openalex-snapshot
The Blow-Up in Translating LTL to Deterministic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_11openalex-snapshot
On Topological Completeness of Regular Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_29openalex-snapshot
Acceptance Conditions for ω-Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_13openalex-snapshot
The Wadge Hierarchy of Petri Nets ω-Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_11openalex-snapshot
Nondeterminism in the Presence of a Diverse or Unknown Future
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_62openalex-snapshot
GOAL for Games, Omega-Automata, and Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_4openalex-snapshot
Topological Complexity of Context-Free ω-Languages: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_5openalex-snapshot
The Safety-Progress Classification
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_14openalex-snapshot
Behaviors of Processes and Synchronized Systems of Processes
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_3openalex-snapshot
Semigroups and Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_10openalex-snapshot
Acceptance of ω-Languages by Communicating Deterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/bf00289715openalex-snapshot
The residue of vector sets with applications to decidability problems in Petri nets
inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferred← citeshttps://doi.org/10.1007/bf02451547openalex-snapshot
Somewhat finite approaches to infinite sentences
inferred← citeshttps://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferred← citeshttps://doi.org/10.1007/bfb0013115openalex-snapshot
Automata and quantifier hierarchies
inferred← citeshttps://doi.org/10.1007/bfb0017144openalex-snapshot
Infinite behaviour of deterministic petri nets
inferred← citeshttps://doi.org/10.1007/bfb0017158openalex-snapshot
A taxonomy of fairness and temporal logic problems for petri nets
inferred← citeshttps://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferred← citeshttps://doi.org/10.1007/bfb0023462openalex-snapshot
On the classification of computable languages
inferred← citeshttps://doi.org/10.1007/bfb0027043openalex-snapshot
Infinitary languages: Basic theory and applications to concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0030294openalex-snapshot
Recent results on automata and infinite words
inferred← citeshttps://doi.org/10.1007/bfb0031560openalex-snapshot
Control theory, modal logic, and games
inferred← citeshttps://doi.org/10.1007/bfb0035767openalex-snapshot
Automata with storage on infinite words
inferred← citeshttps://doi.org/10.1007/bfb0036895openalex-snapshot
Topological characterizations of infinite behaviours of transition systems
inferred← citeshttps://doi.org/10.1007/s00153-008-0101-7openalex-snapshot
Topological complexity of locally finite ω-languages
inferred← citeshttps://doi.org/10.1007/s00236-017-0307-4openalex-snapshot
Spanning the spectrum from safety to liveness
inferred← citeshttps://doi.org/10.1007/s10009-012-0224-3openalex-snapshot
Safety first: a two-stage algorithm for the synthesis of reactive systems
inferred← citeshttps://doi.org/10.1007/s10009-012-0268-4openalex-snapshot
Büchi Store: an open repository of $$\omega $$ -automata
inferred← citeshttps://doi.org/10.1007/s10626-009-0084-5openalex-snapshot
Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state systems
inferred← citeshttps://doi.org/10.1007/s10958-006-0120-zopenalex-snapshot
On infinite real trace rational languages of maximum topological complexity
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90134-4openalex-snapshot
Prefix-free languages as ω-generators
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90019-3openalex-snapshot
ω-Computations on deterministic pushdown machines
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90058-5openalex-snapshot
A decidability result for deterministic ω context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90002-6openalex-snapshot
ω-Computations on Turing machines
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90049-3openalex-snapshot
On the complexity of ω-type Turing acceptors
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90027-0openalex-snapshot
Characterization of ω-regular languages by first-order formulas
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90057-9openalex-snapshot
A note on ω-regular languages
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90115-9openalex-snapshot
Infinite behaviour of Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90049-5openalex-snapshot
Alternating finite automata on ω-words
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90050-1openalex-snapshot
Projection lemmas for ω-languages
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90043-xopenalex-snapshot
A classification of ω-regular languages
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90024-1openalex-snapshot
Characterization of ω-regular languages by monadic second-order formulas
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90166-0openalex-snapshot
Infinite-word languages and continuous mappings
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90170-2openalex-snapshot
Alternation and ω-type Turing acceptors
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90181-7openalex-snapshot
Specification and verification of decentralized daisy chain arbiters with ω-extended regular expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90085-5openalex-snapshot
Topological characterizations of infinite tree languages
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90029-1openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90121-1openalex-snapshot
Accepting conditions for automata on ω-languages
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90053-4openalex-snapshot
Problems concerning fairness and temporal logic for conflict-free petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90152-7openalex-snapshot
Language-theoretical representations of ω-languages
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90018-dopenalex-snapshot
The three subfamilies of rational ω-languages closed under ω-transduction
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90175-fopenalex-snapshot
Strong fairness and ultra metrics
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90342-dopenalex-snapshot
The Hausdorff-Kuratowski hierarchy of ω-regular languages and a hierarchy of Muller automata
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90390-2openalex-snapshot
Fairness, distances and degrees
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90230-qopenalex-snapshot
Synchronized rational relations of finite and infinite words
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80022-2openalex-snapshot
Characterizations of rational ω-languages by means of right congruences
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.009openalex-snapshot
Relating word and tree automata
inferred← citeshttps://doi.org/10.1016/j.ic.2004.03.001openalex-snapshot
On the classification of recursive languages
inferred← citeshttps://doi.org/10.1016/j.ic.2008.10.004openalex-snapshot
A Rice-style theorem for parallel automata
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.021openalex-snapshot
Profile trees for Büchi word automata, with application to determinization
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.030openalex-snapshot
On the descriptional complexity of finite automata with modified acceptance conditions
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.004openalex-snapshot
ω -Regular languages are testable with a constant number of queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.027openalex-snapshot
Weak Muller acceptance conditions for tree automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.038openalex-snapshot
A complete characterization of deterministic regular liveness properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.013openalex-snapshot
Local rule distributions, language complexity and non-uniform cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.052openalex-snapshot
Topology, monitorable properties and runtime verification
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.003openalex-snapshot
Shift-invariant topologies for the Cantor space X
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90415-0openalex-snapshot
On ω-sets associated with context-free languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80048-0openalex-snapshot
A branching time logic with past operators
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80004-4openalex-snapshot
Theory of ω-languagesI: Characterizations of ω-context-free languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80005-6openalex-snapshot
Theory of ω-languages. II: A study of various models of ω-type generation and recognition
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)60888-0openalex-snapshot
Chapter XIV Infinite Behavior of Finite Automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00403-5openalex-snapshot
An introduction to metric semantics: operational and denotational models for programming and specification languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00405-9openalex-snapshot
Topological properties of omega context-free languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00008-1openalex-snapshot
Wadge hierarchy of omega context-free languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00069-xopenalex-snapshot
Effectively closed sets and graphs of computable real functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00042-7openalex-snapshot
Borel hierarchy and omega context free languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00327-4openalex-snapshot
On omega context free languages which are Borel sets of infinite rank
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00584-4openalex-snapshot
Ambiguity in omega context free languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00618-7openalex-snapshot
Unambiguous Büchi automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00006-0openalex-snapshot
Finite acceptance of infinite words
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00245-9openalex-snapshot
Various hierarchies of ω-regular sets
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00251-xopenalex-snapshot
Terminal metric spaces of finitely branching and image finite linear processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00286-2openalex-snapshot
Index sets in computable analysis
inferred← citeshttps://doi.org/10.1017/s0960129510000344openalex-snapshot
A note on accelerated Turing machines
inferred← citeshttps://doi.org/10.1051/ita/1987210201471openalex-snapshot
Sequential mappings of $\omega $-languages
inferred← citeshttps://doi.org/10.1051/ita/1990240605451openalex-snapshot
Saturating right congruences
inferred← citeshttps://doi.org/10.1051/ita/1992260100451openalex-snapshot
Rebootable and suffix-closed $\omega $-power languages
inferred← citeshttps://doi.org/10.1051/ita/2009001openalex-snapshot
Highly Undecidable Problems For Infinite Computations
inferred← citeshttps://doi.org/10.1051/ita/2011113openalex-snapshot
Some problems in automata theory which depend on the models of set theory
inferred← citeshttps://doi.org/10.1051/ita:2003013openalex-snapshot
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
inferred← citeshttps://doi.org/10.1051/ita:2003016openalex-snapshot
On the Topological Complexity of Infinitary Rational Relations
inferred← citeshttps://doi.org/10.1051/ita:2007007openalex-snapshot
Automata, Borel functions and real numbers in Pisot base
inferred← citeshttps://doi.org/10.1051/ita:2007050openalex-snapshot
On the continuity set of an Omega rational function
inferred← citeshttps://doi.org/10.1093/logcom/exag040openalex-snapshot
Applications of discrete-time interval-based temporal separation
inferred← citeshttps://doi.org/10.1109/32.60315openalex-snapshot
Formal analysis of the alternating bit protocol by temporal Petri nets
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351138openalex-snapshot
Safety first: A two-stage algorithm for LTL games
inferred← citeshttps://doi.org/10.1109/fmcad.2013.6679388openalex-snapshot
Efficient handling of obligation constraints in synthesis from omega-regular specifications
inferred← citeshttps://doi.org/10.1109/istcs.1997.595167openalex-snapshot
Weak alternating automata are not that weak
inferred← citeshttps://doi.org/10.1109/lics.1996.561360openalex-snapshot
Relating word and tree automata
inferred← citeshttps://doi.org/10.1109/lics.1998.705645openalex-snapshot
Freedom, weakness, and determinism: from linear-time to branching-time
inferred← citeshttps://doi.org/10.1109/lics.1998.705679openalex-snapshot
How to specify and verify the long-run average behaviour of probabilistic systems
inferred← citeshttps://doi.org/10.1109/lics.2006.28openalex-snapshot
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata
inferred← citeshttps://doi.org/10.1109/lics.2009.32openalex-snapshot
Co-ing Büchi Made Tight and Useful
inferred← citeshttps://doi.org/10.1109/memcod.2004.1459809openalex-snapshot
Bounded model checking of infinite state systems: exploiting the automata hierarchy
inferred← citeshttps://doi.org/10.1109/real.1997.641266openalex-snapshot
On-the-fly symbolic model checking for real-time systems
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
showing the first 200 of 248 · page through all 248
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.