• DML-CZ Home

68Q45 Formal languages and automata (135 articles)

• Kolář, Dušan; Meduna, Alexander; Tomko, Martin: Multi-island finite automata and their even computation. (English). Kybernetika, vol. 57 (2021), issue 5, pp. 856-877
• Pálvölgyi, Dömötör: The range of non-linear natural polynomials cannot be context-free. (English). Kybernetika, vol. 56 (2020), issue 4, pp. 722-726
• Mavlankulov, Gairatzhan; Othman, Mohamed; Turaev, Sherzod; Selamat, Mohd Hasan; Zhumabayeva, Laula; Zhukabayeva, Tamara: Concurrently controlled grammars. (English). Kybernetika, vol. 54 (2018), issue 4, pp. 748-764
• Sun, Ping; Zhang, Lijun; Zhang, Kuize: Reconstructibility of Boolean control networks with time delays in states. (English). Kybernetika, vol. 54 (2018), issue 5, pp. 1091-1104
• Belabbaci, Ahlem; Cherroun, Hadda; Cleophas, Loek; Ziadi, Djelloul: Tree pattern matching from regular tree expressions. (English). Kybernetika, vol. 54 (2018), issue 2, pp. 221-242
• Chatterjee, Kingshuk; Ray, Kumar S.: Watson-Crick pushdown automata. (English). Kybernetika, vol. 53 (2017), issue 5, pp. 868-876
• Reidenbach, Daniel; Schmid, Markus L.: Automata with modulo counters and nondeterministic counter bounds. (English). Kybernetika, vol. 50 (2014), issue 1, pp. 66-94
• Langer, Miroslav: On hierarchy of the positioned eco-grammar systems. (English). Kybernetika, vol. 50 (2014), issue 5, pp. 696-705
• Lukáš, Roman; Meduna, Alexander: Multigenerative grammar systems and matrix grammars. (English). Kybernetika, vol. 46 (2010), issue 1, pp. 68-82
• Blatný, Petr; Bidlo, Radek; Meduna, Alexander: Automata with two-sided pushdowns defined over free groups generated by reduced alphabets. (English). Kybernetika, vol. 43 (2007), issue 3, pp. 265-278
• Meduna, Alexander; Lorenc, Luboš: Self-reproducing pushdown transducers. (English). Kybernetika, vol. 41 (2005), issue 4, pp. [531]-537
• Holub, Jan: Dynamic programming for reduced NFAs for approximate string and sequence matching. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [81]-90
• Šimánek, Milan: The factor automaton. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [105]-111
• Balík, Miroslav: Implementation of directed acyclic word graph. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [91]-103
• Melichar, Bořivoj; Bac, Nguyen van: Transformations of grammars and translation directed by $LR$ parsing. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [13]-44
• Procházka, Martin: On one language with connection to determinism and bounded deleting. (English). Acta Mathematica et Informatica Universitatis Ostraviensis, vol. 8 (2000), issue 1, pp. 111-121
• Bělohlávek, Radim: Algebra grammars. (English). Acta Mathematica et Informatica Universitatis Ostraviensis, vol. 3 (1995), issue 1, pp. 73-(76)
• Mráz, František; Plátek, Martin: Erasing automata recognize more than context-free languages. (English). Acta Mathematica et Informatica Universitatis Ostraviensis, vol. 3 (1995), issue 1, pp. 77-(85)
• Păun, Gheorghe: On the generative capacity of colonies. (English). Kybernetika, vol. 31 (1995), issue 1, pp. 83-97
• Močkoř, Jiří; Smolíková, Renata: Output functions of fuzzy automata. (English). Acta Mathematica et Informatica Universitatis Ostraviensis, vol. 3 (1995), issue 1, pp. 55-(59)
• Meduna, Alexander; Crooks, Cynthia J.; Šárek, Milan: Syntactic complexity of regulated rewriting. (English). Kybernetika, vol. 30 (1994), issue 2, pp. 177-186
• Melichar, Bořivoj: Transformations of translation grammars. (English). Kybernetika, vol. 30 (1994), issue 1, pp. 53-62
• Troll, G.: Formal languages in dynamical systems. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 34 (1993), issue 2, pp. 117-134
• Jančar, Petr: Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. (English). Acta Mathematica et Informatica Universitatis Ostraviensis, vol. 1 (1993), issue 1, pp. 67-73
• Melichar, Bořivoj: Formal translation directed by $LR$ parsing. (English). Kybernetika, vol. 28 (1992), issue 1, pp. 50-61
• Hromkovič, Juraj: Reversals-space-parallelism tradeoffs for language recognition. (English). Mathematica Slovaca, vol. 41 (1991), issue 2, pp. 121-136
• Töpfer, Pavel: An error recovery method for translations of LL(1)-languages [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 31 (1990), issue 1, pp. 196
• Lisoněk, Petr: On related transducers. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 29 (1990), issue 1, pp. 291,292-299
• Vašín, Marek: On the skeletal structure of Pascal statement. (English). Kybernetika, vol. 26 (1990), issue 4, pp. 308-315
• Marcus, Monica; Păun, Gheorghe: Regulated Galiukschov semicontextual grammars. (English). Kybernetika, vol. 26 (1990), issue 4, pp. 316-326
• Niemelä, Lassi: On the directability of automata. (English). Kybernetika, vol. 25 (1989), issue 5, pp. 419-421
• Ngoc, N. V.: The problems of complexity of almost context-free languages [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 202
• Krutský, František: Reducibility and correspondences of pure generalized grammars. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 27 (1988), issue 1, pp. 63-84
• Kelemen, Jozef; Kelemenová, Alica: O biológii, matematike a výpočtoch - rozhovor s A. Lindenmayerom. (Slovak) [On biology, mathematics and computer science - a talk with A. Lindenmayer]. Pokroky matematiky, fyziky a astronomie, vol. 31 (1986), issue 2, pp. 96-105
• Meduna, Alexander: A note on exponential density of ETOL languages. (English). Kybernetika, vol. 22 (1986), issue 6, pp. 514-518
• Drášil, Milan: On languages linearly grammatizable by means of derivatives. (English). Archivum Mathematicum, vol. 22 (1986), issue 3, pp. 139-144
• Kráľová, Mária: Constant ratio-function of Lindenmayer systems. (English). Mathematica Slovaca, vol. 35 (1985), issue 3, pp. 283-294
• Dassow, Jürgen; Păun, Gheorghe: Further remarks on the complexity of regulated rewriting. (English). Kybernetika, vol. 21 (1985), issue 3, pp. 213-227
• Úlehla, Josef: On racial insufficiency: White messengers cannot simulate coloured ones. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 26 (1985), issue 2, pp. 323-325
• Păun, Gheorghe: Two theorems about Galiukschov semicontextual languages. (English). Kybernetika, vol. 21 (1985), issue 5, pp. 360-365
• Beneš, Karel: Simulation of dynamic systems with a transfer function of the type m=n excited by the Dirac function. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 23 (1984), issue 1, pp. 153-159
• Černý, Anton: Descriptional complexity measures of context-free languages. (English). Kybernetika, vol. 19 (1983), issue 3, pp. 237-247
• Krutský, František: Homomorphic correspondences of relational systems. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 22 (1983), issue 1, pp. 37-46
• Kelemenová, Alica: Levels in L-systems. (English). Mathematica Slovaca, vol. 33 (1983), issue 1, pp. 87-97
• Růžička, Milan: Some problems in modelling of real systems by formalized ones. (English). Kybernetika, vol. 19 (1983), issue 1, pp. 76-83
• Allard, André: Sur la structure des automates probabilistes. (French). Mathematica Slovaca, vol. 32 (1982), issue 4, pp. 343-348
• Ostravský, Jan: Acceptors and generalized $lc$-grammars. (English). Archivum Mathematicum, vol. 18 (1982), issue 3, pp. 151-162
• Kopeček, Ivan: Distinguishing subsets in lattices. (English). Archivum Mathematicum, vol. 18 (1982), issue 3, pp. 145-149
• Růžička, Milan: Formalized models of ontological systems. (English). Kybernetika, vol. 18 (1982), issue 6, pp. 545-554
• Růžička, Milan: Input-output systems, their types and applications for the automata theory. (English). Kybernetika, vol. 18 (1982), issue 2, pp. 131-144
• Warner, M. W.: Integral nets and fuzzy relations in deterministic automata. (English). Kybernetika, vol. 18 (1982), issue 1, pp. 22-30
• Pultr, A.; Úlehla, J.: On two problems of mice. (English). In: Frolík, Zdeněk (ed.): Proceedings of the 10th Winter School on Abstract Analysis. Circolo Matematico di Palermo, Palermo, 1982. pp. [249]-262
• Doberkat, Ernst-Erich: Some remarks on the stability problem for linear space automata and semicontinuity of cut point languages. (English). Kybernetika, vol. 18 (1982), issue 2, pp. 89-105
• Pittl, Jan: Characterizations of stack uniform strict deterministic languages. (English). Kybernetika, vol. 17 (1981), issue 3, pp. 209-221
• Kříž, Blažej: Generalized grammatical categories in the sense of Kunze. (English). Archivum Mathematicum, vol. 17 (1981), issue 3, pp. 151-158
• Novák, Vítězslav: Verallgemeinerte Sprachen und ihre Homomorphismen. (German) [Generalized languages and their homomorphisms]. Archivum Mathematicum, vol. 16 (1980), issue 2, pp. 115-125
• Brůha, Ivan: Learning extremal regulator implementation by a stochastic automaton and stochastic approximation theory. (English). Aplikace matematiky, vol. 25 (1980), issue 5, pp. 315-323
• Adámek, Jiří; Ehrig, Hartmut; Trnková, Věra: On an equivalence of system-theoretical and categorical concepts. (English). Kybernetika, vol. 16 (1980), issue 5, pp. (389)-410
• Zedník, František: On one definition of grammatical categories. (English). Sborník prací Přírodovědecké fakulty University Palackého v Olomouci. Matematika, vol. 19 (1980), issue 1, pp. 75-87
• Jürgensen, H.; Tikovsky, H.-D: Abgeschwächte Observabilitätsbegriffe für stochastische Automaten. (German) [Degradated observability for stochastic automata]. Kybernetika, vol. 15 (1979), issue 5, pp. (388)-397
• Jürgensen, H.: Disjunktive Teilmengen inverser Halbgruppen. (German) [Disjoint subsets in inverse semigroups]. Archivum Mathematicum, vol. 15 (1979), issue 4, pp. 205-207
• Coardoş, Vasile: Equations associated with a context-free grammar. (English). Kybernetika, vol. 15 (1979), issue 4, pp. (253)-260
• Pik, Jiří: A note on connections between 0L-languages and context-free languages. (English). Kybernetika, vol. 15 (1979), issue 2, pp. (136)-140
• Sgall, Petr: Matematický popis přirozených jazyků. (Czech) [Mathematical description of natural languages]. Pokroky matematiky, fyziky a astronomie, vol. 23 (1978), issue 3, pp. 140-148
• Mareš, Jan: Conditional programmed automata. (English). Kybernetika, vol. 14 (1978), issue 4, pp. (227)-244
• Dalík, Josef: An embedding problem and its application in linguistics. (English). Archivum Mathematicum, vol. 14 (1978), issue 3, pp. 123-137
• Havel, Ivan M.; Kramosil, Ivan: A stochastic approach to robot plan formation. (English). Kybernetika, vol. 14 (1978), issue 3, pp. (143)-173
• Păun, Gheorghe: Two infinite hierarchies of languages defined by branching grammars. (English). Kybernetika, vol. 14 (1978), issue 6, pp. (397)-407
• Dalík, Josef: Verbandstheoretische Eigenschaften von Sprachen. II. (German) [Lattice-theoretical properties of languages. II]. Archivum Mathematicum, vol. 13 (1977), issue 1, pp. 13-23
• Adámek, Jiří; Koubek, Václav: Functorial algebras and automata. (English). Kybernetika, vol. 13 (1977), issue 4, pp. (245)-260
• Kindler, Evžen: Mathematical theory of static systems. (English). Kybernetika, vol. 13 (1977), issue 3, pp. (176)-189
• Kramosil, Ivan: Mechanized experiment planning in automaton-environment systems. (English). Kybernetika, vol. 13 (1977), issue 4, pp. (225)-244
• Benda, Václav; Bendová, Kamila: On families recognizable by finite branching automata. (English). Kybernetika, vol. 13 (1977), issue 5, pp. (293)-319
• Dalík, Josef: Verbandstheoretische Eigenschaften von Sprachen. (German) [Lattice-theoretical properties of languages]. Archivum Mathematicum, vol. 12 (1976), issue 1, pp. 31-42
• Kunc, Pavel: Asynchronous serioparallel execution of the loop. (English). Kybernetika, vol. 12 (1976), issue 1, pp. (15)-19
• Starke, Peter H.: Closedness properties and decision problems for finite multi-tape automata. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (61)-75
• Chytil, Michal P.: Crossing-bounded computations and their relation to the LBA-problem. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (76)-85
• Korshunov, A. D.: The number of automata, boundedly determined functions and hereditary properties of automata. (English). Kybernetika, vol. 12 (1976), issue 1, pp. (31)-37
• Fuchs, Jaromír: On closure operators on monoids. (English). Archivum Mathematicum, vol. 12 (1976), issue 4, pp. 225-232
• Zech, Karl-Adolf: On networks of non-deterministic automata. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (86)-102
• Benda, Václav; Bendová, Kamila: Recognizable filters and ideals. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 17 (1976), issue 2, pp. 251-259
• Kramosil, Ivan: A selection-based formal description of an environment. (English). Kybernetika, vol. 12 (1976), issue 3, pp. (127)-150
• Kindler, Evžen: Mathematical theory of free rhythm. (English). Kybernetika, vol. 11 (1975), issue 3, pp. (223)-233
• Trnková, Věra: Minimal realizations for finite sets in categorial automata theory. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 16 (1975), issue 1, pp. 21-35
• Gruska, Jozef: A note on $\varepsilon$-rules in context-free grammars. (English). Kybernetika, vol. 11 (1975), issue 1, pp. (26)-31
• Mezník, Ivan: On $G$-machines generating intersection and union of generable languages. (English). Kybernetika, vol. 11 (1975), issue 6, pp. (391)-397
• Růžička, Peter: On the size of DeRemer's analyzers. (English). Kybernetika, vol. 11 (1975), issue 3, pp. (207)-217
• Kramosil, Ivan: A probabilistic approach to automaton-environment systems. (English). Kybernetika, vol. 11 (1975), issue 3, pp. (173)-206
• Jirků, Petr: Towards an integrated theory of formal and natural languages. (English). Kybernetika, vol. 11 (1975), issue 2, pp. (91)-100
• Havránek, Tomáš: An application of logical-probabilistic expressions to the realization of stochastic automata. (English). Kybernetika, vol. 10 (1974), issue 3, pp. (241)-257
• Novotný, Miroslav: Complete characterization of context-sensitive languages. (English). Kybernetika, vol. 10 (1974), issue 2, pp. (73)-79
• Havránek, Tomáš: The computation of characteristic vectors of logical-probabilistic expressions. (English). Kybernetika, vol. 10 (1974), issue 2, pp. (80)-94
• Havel, Ivan M.: Finite branching automata. (English). Kybernetika, vol. 10 (1974), issue 4, pp. (281)-302
• Adámek, Jiří: Free algebras and automata realizations in the language of categories. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 4, pp. 589-602
• Zedník, Josef: A generalization of configurations in the sense of Gladkij. (English). Sborník prací Přírodovědecké fakulty University Palackého v Olomouci. Matematika, vol. 14 (1974), issue 1, pp. 83-91
• Havránek, Tomáš: A generalization of the propositional calculus for purposes of the theory of logical nets with probabilistic elements. (English). Kybernetika, vol. 10 (1974), issue 1, pp. (13)-43
• Asztalos, Domonkos: A note on van Wijngaarden syntax. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 4, pp. 347-351
• Zelinka, Bohdan: The Number of Non-Isomorphic Hamiltonian Circuits in an $n$-Dimensional Cube. (English). Matematický časopis, vol. 24 (1974), issue 3, pp. 203-208
• Trnková, Věra: On minimal realizations of behavior maps in categorial automata theory. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 3, pp. 555-566
• Mikloško, J.: Parallelism in numerical analysis. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 15 (1974), issue 1, pp. 103-104
• Norris, Eugene M.: Relative Act Ideals. (English). Matematický časopis, vol. 24 (1974), issue 3, pp. 195-202
• Alad'ev, Viktor: Об эквивалентности $\tau_m$-грамматик и $Sb(n)$-грамматик. (Russian) [The equivalence of $\tau_m$-grammars and $Sb(n)$-grammars]. Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 4, pp. 717-726
• Alad'ev, Viktor: Операции над языками, генерируемыми $\tau_n$-грамматиками. (Russian) [Operations over languages that are generated by $\tau_n$-grammars]. Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 2, pp. 211-220
• Novotný, Miroslav: Problémy matematické lingvistiky řešené československými matematiky. (Czech) [Problems of mathematical linguistics studied by Czechoslovak mathematicians]. Pokroky matematiky, fyziky a astronomie, vol. 18 (1973), issue 6, pp. 311-321
• Gruska, Jozef: Grammatical levels and subgrammars of context-free grammars. (English). Archivum Mathematicum, vol. 9 (1973), issue 1, pp. 19-21
• Král, Jaroslav: A note on grammars with regular restrictions. (English). Kybernetika, vol. 9 (1973), issue 3, pp. (159)-161
• Mezník, Ivan: On some closure properties of generable languages. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 14 (1973), issue 3, pp. 541-552
• Gruska, Jozef: On star height hierarchies of context-free languages. (English). Kybernetika, vol. 9 (1973), issue 4, pp. (231)-236
• Baldrián, Jiří: On strong homomorphisms of finitely semigenerated languages. (English). Archivum Mathematicum, vol. 9 (1973), issue 2, pp. 89-97
• Nekvinda, Miloslav: On the complexity of events recognizable in real time. (English). Kybernetika, vol. 9 (1973), issue 1, pp. (1)-10
• Cremers, A. B.; Weiss, K.: Some further remarks on the index of context-free languages. (English). Kybernetika, vol. 9 (1973), issue 6, pp. (461)-466
• Čulík, Karel: Syntactical definitions of program and flow diagram. (English). Aplikace matematiky, vol. 18 (1973), issue 4, pp. 280-301
• Katětov, Miroslav: Baire classification and infinite perceptrons. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 13 (1972), issue 2, pp. 373-396
• Pirická, Alica: Directable automata and directly subdefinite events. (English). Kybernetika, vol. 8 (1972), issue 5, pp. (395)-403
• Mareš, Jan: A note on Glushkov's algorithm of the synthesis of finite automata. (English). Kybernetika, vol. 8 (1972), issue 4, pp. (289)-296
• Čulík, Karel; Vrba, Antonín: On the number of initial segments of a finite set of sequences (finite language). (English). Časopis pro pěstování matematiky, vol. 97 (1972), issue 4, pp. 389-398
• Gruska, Jozef: On the size of context-free grammars. (English). Kybernetika, vol. 8 (1972), issue 3, pp. (213)-218
• Nebeský, Ladislav: A planar test of linguistic projectivity. (English). Kybernetika, vol. 8 (1972), issue 4, pp. (351)-354
• Hladký, Miroslav: Precedence relations and their connection with unambiguity of context-free grammars. (English). Kybernetika, vol. 8 (1972), issue 1, pp. (1)-11
• Šiškov, D. B.: Минимизация конечных автоматов. (Russian) [Minimization of finite automata]. Kybernetika, vol. 8 (1972), issue 4, pp. (297)-316
• Černý, Ján; Pirická, Alica; Rosenauerová, Blanka: On directable automata. (English). Kybernetika, vol. 7 (1971), issue 4, pp. (289)-298
• Černý, Ján: Note on Stochastic Transformers. (English). Matematický časopis, vol. 20 (1970), issue 2, pp. 101-108
• Novotný, Miroslav: On a class of languages. (English). Archivum Mathematicum, vol. 6 (1970), issue 3, pp. 155-170
• Černý, Ján; Vinař, Jan: On Simple Stochastic Models. (English). Matematický časopis, vol. 20 (1970), issue 4, pp. 293-303
• Novotný, Miroslav: On the role of configurations in the theory of grammars. (English). Archivum Mathematicum, vol. 6 (1970), issue 3, pp. 171-184
• Thierrin, Gabriel: Simple automata. (English). Kybernetika, vol. 6 (1970), issue 5, pp. (343)-350
• Kopřiva, Jiří: A contribution to the top-to-bottom recognizer rehabilitation. (English). Kybernetika, vol. 4 (1968), issue 3, pp. (193)-200
• Čulík, Karel: Some theorems on labelled bracketings used in transformational grammars. (English). Kybernetika, vol. 4 (1968), issue 2, pp. (87)-92
• Savchenko, Yu. G.: О построении цифровых автоматов с автокорекцией ошибок. (Russian) [On a construction of digital automata with automatic correction of errors]. Kybernetika, vol. 4 (1968), issue 5, pp. (463)-470
• Čulík, Karel II: Relace representované $n$-páskovými automaty. (Czech) [Relations defined by $n$-tape automata]. Kybernetika, vol. 3 (1967), issue 4, pp. (321)-345
• Pužman, Josef: Syntéza a minimalizace regulárních lineárních generátorů. (Czech) [Synthesis and minimization of regular linear generators]. Kybernetika, vol. 3 (1967), issue 2, pp. (127)-146
• Král, Jaroslav: Set-theoretical operations on $k$-multiple languages. (English). Kybernetika, vol. 3 (1967), issue 4, pp. (315)-320
• Černý, Ján: Synthesis of non-initial automata. (English). Kybernetika, vol. 3 (1967), issue 4, pp. (346)-351
• Šiškov, Dimitr B.: Агрегатная декомпозиция автоматов и управление агрегатами. (Russian) [Decomposition of automata into aggregates and its control]. Kybernetika, vol. 3 (1967), issue 5, pp. (438)-450
• Kopřiva, Jiří: Generalization of well-translation of formal languages. (English). Kybernetika, vol. 2 (1966), issue 4, pp. (305)-313