The Theory of Definite Automata
From MaRDI portal
Cited in
(46)- La représentation ergodique d'un automate fini
- An interconnection of local maps inducing onto global maps
- General varieties of tree languages
- On the bound of the synchronization delay of a local automaton
- Reset words for commutative and solvable automata
- Optimal estimation on the order of local testability of finite automata
- Resetting words for decidable automata
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- Remarks on external contextual grammars with selection
- A trichotomy for regular simple path queries on graphs
- Closure properties of subregular languages under operations
- The labeling graphs of definite automata
- Determination of finite automata accepting subregular languages
- A sufficient condition to polynomially compute a minimum separating DFA
- Concatenation-free languages
- A tight linear bound on the synchronization delay of bijective automata
- Locally testable languages
- Characterizations of locally testable events
- Number of labelings of definite automata graphs
- Aspects of reversibility for classical automata
- Expressive capacity of concatenation freeness
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Finitely Generated Synchronizing Automata
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- Algebraic decision procedures for local testability
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
- Definite and Quasidefinite Sets of Stochastic Matrices
- Synchronizing automata with finitely many minimal synchronizing words
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- On probabilistic analog automata
- On the generative capacity of contextual grammars with strictly locally testable selection languages
- Merging two hierarchies of external contextual grammars with subregular selection
- String matching algorithms and automata
- Relations of contextual grammars with strictly locally testable selection languages
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
- An exploration of reversible septenary number-conserving cellular automata: a survey of known methods
- Remarks on context-free grammars with subregular control languages
- On the acceptance power of regular languages
- Internal contextual grammars with resources restricted and structure limited selection
- Subregular expressions with two operations
- Closure properties of subregular languages under operations
- Subregularly controlled insertion systems
- Various types of comet languages and their application in external contextual grammars
- Merging two hierarchies of internal contextual grammars with subregular selection
- External contextual grammars with resources restricted and structure limited selection
This page was built for publication: The Theory of Definite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540449)
