Deterministic biautomata and subclasses of deterministic linear languages
From MaRDI portal
Publication:2278286
DOI10.1007/978-3-030-13435-8_23zbMATH Open1425.68209OpenAlexW2911875747MaRDI QIDQ2278286FDOQ2278286
Authors: Galina Jirásková, Ondřej Klíma 
Publication date: 4 December 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_23
Recommendations
- On linear languages recognized by deterministic biautomata
- A Bialgebraic Approach to Automata and Formal Language Theory
- A bialgebraic approach to automata and formal language theory
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- scientific article; zbMATH DE number 2089362
- Bideterministic automata and minimal representations of regular languages
- Bideterministic Automata and Minimal Representations of Regular Languages
- Determinization of Büchi-Automata
- scientific article; zbMATH DE number 1948516
- Abstract families of deterministic languages
Cited In (6)
- More structural characterizations of some subregular language families by biautomata
- Grammatical Inference: Algorithms and Applications
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- On biautomata
- On the Transformation of LL(k)-linear Grammars to LL(1)-linear
- On linear languages recognized by deterministic biautomata
This page was built for publication: Deterministic biautomata and subclasses of deterministic linear languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278286)
