Languages and scanners

DOI10.1016/0304-3975(91)90258-4zbMath0753.68054OpenAlexW2044010368MaRDI QIDQ1177931

Jean-Eric Pin, Danièle Beauquier

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90258-4

zbMATH Keywords

finite automatasyntactic semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Bilateral locally testable languages. ⋮ Strongly locally testable semigroups with commuting idempotents and related languages ⋮ A new algorithm for testing if a regular language is locally threshold testable ⋮ Over testable languages ⋮ Subshifts as models for MSO logic ⋮ Which security policies are enforceable by runtime monitors? A survey ⋮ Regular languages and Stone duality ⋮ Reversible Regular Languages: Logical and Algebraic Characterisations ⋮ Locally commutative power semigroups and counting factors of words ⋮ Execution monitoring enforcement under memory-limitation constraints ⋮ AROUND DOT-DEPTH ONE ⋮ Expressive power of existential first-order sentences of Büchi's sequential calculus ⋮ Local testability from words to traces, a suitable definition ⋮ Logic, semigroups and automata on words ⋮ Automata on finite trees ⋮ Families of locally testable languages ⋮ LANGAGE: A Maple package for automaton characterization of regular languages ⋮ Right and left locally testable languages

Cites Work

• First-order logic and star-free sets
• Classifying regular events in symbolic logic
• Finite semigroup varieties of the form V*D
• Graph congruences and wreath products
• Characterizations of locally testable events
• Algebraic decision procedures for local testability
• $ℵ_0$-categoricity of linear orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Languages and scanners