Automata, Boolean matrices, and ultimate periodicity.

DOI10.1006/inco.1998.2787zbMath1045.68587OpenAlexW2171084562MaRDI QIDQ1854295

Yanyan Li

Publication date: 14 January 2003

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

Full work available at URL: https://semanticscholar.org/paper/912ebfb73f89275ec9ea48fe7e71bbd0406d6cb2

zbMATH Keywords

subtraction problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (10)

Factorization in Formal Languages ⋮ Deletion along trajectories ⋮ On transformations of formal power series. ⋮ STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS ⋮ Algebraic state space approach to model and control combined automata ⋮ Language acceptability of finite automata based on theory of semi‐tensor product of matrices ⋮ Finite Automata, Palindromes, Powers, and Patterns ⋮ Unique decipherability in formal languages ⋮ STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET ⋮ Detecting palindromes, patterns and borders in regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete systems of \(\mathcal B\)-rational identities
• Regularity-preserving relations
• A completeness theorem for Kleene algebras and the algebra of regular events
• Characterizing PAC-learnability of semilinear sets
• Regularity preserving modifications of regular expressions
• Equational axioms for regular sets
• Two Complete Axiom Systems for the Algebra of Regular Events

This page was built for publication: Automata, Boolean matrices, and ultimate periodicity.