How to Split Recursive Automata

DOI10.1007/978-3-540-88009-7_16zbMATH Open1177.68124OpenAlexW1549352442MaRDI QIDQ3528419FDOQ3528419

Authors: Isabelle Tellier 

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00341770/file/icgi08-tellier.pdf

Recommendations

• Separating strings with small automata
• Splitting the internal states in order to reduce the number of arguments in functions of finite automata
• scientific article; zbMATH DE number 3874627
• From finite automata to fractal automata -- the power of recursion
• Splitting theorems in recursion theory
• scientific article; zbMATH DE number 512868
• Automatically splitting a two-stage lambda calculus
• scientific article; zbMATH DE number 3888919
• A split-based incremental deterministic automata minimization algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Cited In (2)

• Learning Lambek grammars from proof frames
• Good types are useful for learning

This page was built for publication: How to Split Recursive Automata

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