Büchi context-free languages
From MaRDI portal
Publication:627181
DOI10.1016/J.TCS.2010.11.026zbMATH Open1206.68171OpenAlexW1989510068MaRDI QIDQ627181FDOQ627181
Authors: Zoltán Ésik, Szabolcs Iván 
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.026
Recommendations
Cites Work
- Title not available (Why is that?)
- Finite automata and ordinals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Title not available (Why is that?)
- Weak Second‐Order Arithmetic and Finite Automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree acceptors and some of their applications
- $ℵ_0$-categoricity of linear orderings
- The monadic second order theory of all countable ordinals
- Logic and Rational Languages of Words Indexed by Linear Orderings
- Title not available (Why is that?)
- Automata on linear orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- The equational theory of regular words
- Title not available (Why is that?)
- Context-Free Languages of Countable Words
- On frontiers of regular trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatizing omega and omega-op powers of words
- Linear languages of finite and infinite words
- Developments in Language Theory
- Long words: The theory of concatenation and \(\omega\)-power
Cited In (11)
- OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs
- Title not available (Why is that?)
- On context-free languages of scattered words
- Regular expressions for Muller context-free languages
- The edit-distance between a regular language and a context-free language
- MSO-definable properties of Muller context-free languages are decidable
- On Müller context-free grammars
- Logic for \(\omega\)-pushdown automata
- On Müller context-free grammars
- Linear languages of finite and infinite words
- Formal languages defined by the underlying structure of their words
This page was built for publication: Büchi context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627181)
