scientific article; zbMATH DE number 2038747
From MaRDI portal
Publication:4449212
zbMath1039.03004MaRDI QIDQ4449212
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190681.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (26)
XML schema, tree logic and sheaves automata ⋮ Unnamed Item ⋮ On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) ⋮ A positive extension of Eilenberg's variety theorem for non-regular languages ⋮ Synchronization of Parikh automata ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Jumping automata over Infinite words ⋮ On the existential arithmetics with addition and bitwise minimum ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ On the almighty wand ⋮ Unnamed Item ⋮ On the Almighty Wand ⋮ ``Most of leads to undecidability: failure of adding frequencies to LTL ⋮ Verifying quantitative temporal properties of procedural programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidable weighted expressions with Presburger combinators ⋮ The algebraic theory of Parikh automata ⋮ Capacitated automata and systems ⋮ On a class of languages with holonomic generating functions ⋮ On Reachability Problems for Low-Dimensional Matrix Semigroups ⋮ Unnamed Item ⋮ Combining Theories with Shared Set Operations ⋮ Unnamed Item ⋮ A Pattern Logic for Automata with Outputs ⋮ Projection for Büchi Tree Automata with Constraints between Siblings
This page was built for publication:
