scientific article; zbMATH DE number 2087432

zbMath1077.03508MaRDI QIDQ4738227

Paweł Urzyczyn, Damian Niwinski, Teodor Knapik

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2303/23030205.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items

The grammar of mammalian brain capacity, Verification of opacity and diagnosability for pushdown systems, The mu-calculus and Model Checking, Rewriting Higher-Order Stack Trees, Rewriting higher-order stack trees, Recursion Schemes and the WMSO+U Logic, Finitary Semantics of Linear Logic and Higher-Order Model-Checking, The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic, Cost Automata, Safe Schemes, and Downward Closures, Unnamed Item, Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable, Contribution of Warsaw logicians to computational logic, Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence, On the structure of graphs in the Caucal hierarchy, Krivine machines and higher-order schemes, Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems, Krivine Machines and Higher-Order Schemes, Unnamed Item, Functional programs as compressed data, On first-order logic and CPDA graphs, Unnamed Item, Iterated pushdown automata and sequences of rational numbers, Epsilon-reducible context-free languages and characterizations of indexed languages, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes, Unnamed Item, Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence, Unnamed Item, Automata, Logic and Games for the $$\lambda $$ -Calculus, On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems, Unnamed Item, Regular sets over extended tree structures, Domains for Higher-Order Games, Streett Automata Model Checking of Higher-Order Recursion Schemes, Unnamed Item, Model-Checking Games for Typed λ-Calculi, The IO and OI hierarchies revisited, MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies, Shelah-Stupp's and Muchnik's iterations revisited