scientific article; zbMATH DE number 6829382
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2016.41zbMath1388.68154arXiv1506.07774MaRDI QIDQ4601893
Publication date: 24 January 2018
Full work available at URL: https://arxiv.org/abs/1506.07774
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Context-free commutative grammars with integer counters and resets, Problems on finite automata and the exponential time hypothesis, Decidability and complexity for quiescent consistency and its variations, State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs, A type checking algorithm for concurrent object protocols, Unnamed Item, Problems on Finite Automata and the Exponential Time Hypothesis