Green’s Relations and Their Use in Automata Theory

DOI10.1007/978-3-642-21254-3_1zbMath1330.68152OpenAlexW773965MaRDI QIDQ3004564

Thomas Colcombet

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (10)

Approximate comparison of functions computed by distance automata ⋮ Codes and Automata in Minimal Sets ⋮ Complexity Analysis: Transformation Monoids of Finite Automata ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Pebble minimization: the last theorems ⋮ Positive First-order Logic on Words and Graphs ⋮ Green's classifications and evolutions of fixed-order networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ State complexity of permutation and related decision problems on alphabetical pattern constraints

This page was built for publication: Green’s Relations and Their Use in Automata Theory