Deterministic suffix-reading automata

DOI10.4204/EPTCS.409.9MaRDI QIDQ6940518zbMATH OpenFDO

Authors R. Keerthan, B. Srivathsan, Raghul S. Venkatesh, Sagar Verma

Publication date 19 August 2025

Full work available at URL https://doi.org/10.4204/EPTCS.409.9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language
• Boolean Matrices and the Stability of Neural Nets
• Complexity results for two-way and multi-pebble automata and their logics
• Computer Aided Verification
• Deterministic generalized automata
• General suffix automaton construction algorithm and space bounds
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Implementation and Application of Automata
• Minimal NFA Problems are Hard
• Model checking
• Reducibility among combinatorial problems
• Regular model checking
• Statecharts: a visual formalism for complex systems
• Symbolic finite state transducers: algorithms and applications
• The power of symbolic automata and transducers

Cited in

(1)

• Deterministic suffix-reading automata

This page was built for publication: Deterministic suffix-reading automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940518)