From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods

DOI10.1007/978-3-319-22360-5_15zbMath1465.68151OpenAlexW1423874546MaRDI QIDQ2947420

Mans Hulden

Publication date: 23 September 2015

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex drawings of 3-connected plane graphs
• Finite automata and unary languages
• A note on the reduction of two-way automata to one-way automata
• Intersection and union of regular languages and state complexity
• Optimal Simulations between Unary Automata
• State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
• A Second Course in Formal Languages and Automata Theory
• Size Complexity of Two-Way Finite Automata
• Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
• State-complexity of finite-state devices, state compressibility and incompressibility
• Mathematical Foundations of Computer Science 2005

This page was built for publication: From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods