A PAC Learnability of Simple Deterministic Languages
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Balanced Grammars and Their Languages
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Introduction to Decidability of DPDA Equivalence
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Formal models for some features of programming languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
Hierarchies and Characterizations of Stateless Multicounter Machines
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Stateless Multicounter Machines
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On the computational complexity of bisimulation, redux
Information and Computation
On decision problems for parameterized machines
Theoretical Computer Science
Complexity metatheorems for context-free grammar problems
Journal of Computer and System Sciences
Completeness results for the equivalence of recursive schemas
Journal of Computer and System Sciences
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Structural equivalence of context-free grammars
Journal of Computer and System Sciences
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Conjunctive grammars with restricted disjunction
Theoretical Computer Science
Reducing simple grammars: exponential against highly-polynomial time in practice
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Concatenation state machines and simple functions
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Equivalence of functions represented by simple context-free grammars with output
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
A formal specification of document processing
Mathematical and Computer Modelling: An International Journal
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
A Survey of Results on Stateless Multicounter Automata
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case
Natural Computing: an international journal
| Hi-index | 0.00 |
The s-languages are those languages recognized by a particular restricted form of deterministic pushdown automaton, called an s-machine. They are uniquely characterized by that subset of the standard-form grammars in which each rule has the form Z → aY1...Yn, n≥0, and for which the pairs (Z, a) are distinct among the rules. It is shown that the s-languages have the prefix property, and that they include the regular sets with end-markers. Finally, their closure properties and decision problems are examined, and it is found that their equivalence problem is solvable. Since the solvability of the equivalence problem is not known for arbitrary deterministic languages, the s-languages are the most general class of languages for which this problem has been shown to be solvable.