On a subclass of -regular languages

DOI10.1016/0304-3975(88)90105-3MaRDI QIDQ1104761zbMATH OpenOpenAlexFDO

Authors Ivan Mezník

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0304-3975(88)90105-3

zbMATH Keywords

\(\infty \)-regular languagesG-languagesG-machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
• scientific article; zbMATH DE number 940749
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• \(\mathcal{PS}\)-regular languages
• Classes of regular and context-free languages over countably infinite alphabets

Cites work

• scientific article; zbMATH DE number 4019040 (Why is no real title available?)
• scientific article; zbMATH DE number 3902039 (Why is no real title available?)
• scientific article; zbMATH DE number 3658971 (Why is no real title available?)
• scientific article; zbMATH DE number 3501028 (Why is no real title available?)
• scientific article; zbMATH DE number 3514986 (Why is no real title available?)
• scientific article; zbMATH DE number 3516664 (Why is no real title available?)
• scientific article; zbMATH DE number 3578343 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3322974 (Why is no real title available?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Fixed-point characterization of context-free ∞-languages
• G-machines and generable sets
• Generable sets
• Sets constructed by acceptors
• Testing and generating infinite sequences by a finite automaton
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition

Cited in

(7)

• scientific article; zbMATH DE number 7168170 (Why is no real title available?)
• Classes of regular and context-free languages over countably infinite alphabets
• On the power of subroutines for finite state machines
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Non-regular Maximal Prefix-Free Subsets of Regular Languages
• An algebraic characterization of deterministic regular languages over infinite alphabets.
• Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines

This page was built for publication: On a subclass of \(\infty\)-regular languages

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