Generalizations of 1-deterministic regular languages

DOI10.1016/j.ic.2008.03.013zbMath1154.68069OpenAlexW2056112658MaRDI QIDQ948081

Derick Wood, Yo-Sub Han

Publication date: 8 October 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.013

zbMATH Keywords

one-unambiguous regular languages\(k\)-block determinism\(k\)-lookahead determinism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

On the Hierarchy of Block Deterministic Languages ⋮ Predictable semiautomata ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ Deterministic regular expressions with back-references ⋮ On the hierarchy of generalizations of one-unambiguous regular languages

Uses Software

• LANGAGE

Cites Work

• Deterministic generalized automata
• Regular expressions into finite automata
• Characterization of Glushkov automata
• Computer science today. Recent trends and developments
• THE ABSTRACT THEORY OF AUTOMATA
• THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
• Boolean Matrices and the Stability of Neural Nets
• One-unambiguous regular languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalizations of 1-deterministic regular languages