Pages that link to "Item:Q1240574"

The following pages link to Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574):

Displaying 47 items.

• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
• Output concepts for accelerated Turing machines (Q609032) (← links)
• Büchi context-free languages (Q627181) (← links)
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
• Affine automata and related techniques for generation of complex images (Q685366) (← links)
• On Müller context-free grammars (Q764314) (← links)
• Finite-state \(\omega\)-languages (Q794443) (← links)
• Alternating finite automata on \(\omega\)-words (Q796990) (← links)
• Infinite arrays and controlled deterministic table 0L array systems (Q797993) (← links)
• Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
• Real functions and numbers defined by Turing machines (Q1050122) (← links)
• Init and Anf operating on \(\omega\)-languages (Q1056238) (← links)
• On infinite words obtained by selective substitution grammars (Q1066676) (← links)
• Description and reasoning of VLSI circuit in temporal logic (Q1075756) (← links)
• Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions (Q1079373) (← links)
• Merging regular processes by means of fixed-point theory (Q1082070) (← links)
• Characterization and closure properties of linear \(\omega\)-languages (Q1127314) (← links)
• On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
• Adherences of languages (Q1157971) (← links)
• Rational and affine expressions for image description (Q1208468) (← links)
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
• \(\omega\)-computations on Turing machines (Q1242685) (← links)
• \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
• Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
• Ambiguity in omega context free languages (Q1399989) (← links)
• A hierarchy of deterministic context-free \(\omega\)-languages. (Q1401159) (← links)
• Borel hierarchy and omega context free languages. (Q1401165) (← links)
• On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
• Logic for \(\omega\)-pushdown automata (Q2064532) (← links)
• Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
• Infinite behaviour of Petri nets (Q2265817) (← links)
• Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata (Q2672253) (← links)
• MSO-definable Properties of Muller Context-Free Languages Are Decidable (Q2829973) (← links)
• Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition (Q2842604) (← links)
• (Q4147597) (← links)
• (Q4168081) (← links)
• (Q5016362) (← links)
• (Q5028456) (← links)
• (Q5101346) (← links)
• OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs (Q5247171) (← links)
• ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS (Q5495418) (← links)
• Distributed ω-Automata (Q5696932) (← links)
• Topological properties of omega context-free languages (Q5958141) (← links)
• Wadge hierarchy of omega context-free languages (Q5958618) (← links)
• The Triple-Pair Construction for Weighted ω-Pushdown Automata (Q6114867) (← links)
• Constrained properties, semilinear systems, and Petri nets (Q6162100) (← links)
• Quantum Büchi automata (Q6593677) (← links)